منابع مشابه
Some Criteria for Acceptable Abstraction
where the variables α and β range over entities of some sort, and where ∼ is an equivalence relation on this sort of entity. Frege’s inconsistent Basic Law V shows that not every such principle is acceptable. A variety of criteria for acceptable abstraction have been proposed.1 In this note I analyze the logical relations between some of the proposed criteria, in particular conservativeness, ir...
متن کاملCardinality Abstraction for Declarative Networking Applications
Declarative Networking is a recent, viable approach to make distributed programming easier, which is becoming increasingly popular in systems and networking community. It offers the programmer a declarative, rule-based language, called P2, for writing distributed applications in an abstract, yet expressive way. This approach, however, imposes new challenges on analysis and verification methods ...
متن کاملCardinality, Counting, and Equinumerosity
Frege, famously, held that there is a close connection between our concept of cardinal number and the notion of one-one correspondence, a connection enshrined in Hume’s Principle. Husserl, and later Parsons, objected that there is no such close connection, that our most primitive conception of cardinality arises from our grasp of the practice of counting. Some empirical work on children’s devel...
متن کاملCreationism and Cardinality
Creationism about fictional entities is the doctrine that fictional entities come into existence when the fictions about them are composed: it may be contrasted both with a more platonist view according to which all potential fictional entities have always existed, and eliminativist views according to which there are no merely fictional entities. Creationism is alleged to have a number of advan...
متن کاملRelative Randomness and Cardinality
A set B ⊆ N is called low for Martin-Löf random if every Martin-Löf random set is also Martin-Löf random relative to B. We show that a ∆2 set B is low for Martin-Löf random iff the class of oracles which compress less efficiently than B, namely the class C = {A | ∀n K(n) ≤ K(n)} is countable (where K denotes the prefix free complexity and ≤ denotes inequality modulo a constant). It follows that...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 2018
ISSN: 0029-4527
DOI: 10.1215/00294527-2017-0012